Adaptively reacting to resource utilization messages including channel gain indication

ABSTRACT

An adaptable decision parameter is used to determine whether to react to resource utilization messages. The decision parameter may comprise a decision threshold that is adapted based on received resource utilization messages. The decision parameter may comprise a probability that is used to determine whether to react to a received resource utilization message. Such a probability may be based on, for example, one or more channel conditions, the number of interferers seen by a node, the number of received resource utilization messages, or some other form of resource utilization message-related information.

CROSS-REFERENCE TO RELATED APPLICATION

This application is related to concurrently filed and commonly ownedU.S. patent application Ser. No. 12/055,148, entitled “ADAPTING DECISIONPARAMETER FOR REACTING TO RESOURCE UTILIZATION MESSAGES,” and assignedAttorney Docket No. 060107U1, the disclosure of which is herebyincorporated by reference herein.

BACKGROUND

1. Field

This application relates generally to wireless communication and morespecifically, but not exclusively, to adaptively reacting tocommunication messages.

2. Introduction

Deployment of a wireless communication system typically involvesimplementing some form of interference mitigation scheme. In somewireless communication systems, interference may be caused byneighboring wireless nodes. As an example, in a cellular system wirelesstransmissions of a cell phone or a base station of a first cell mayinterfere with communication between a cell phone and a base station ofa neighboring cell. Similarly, in a Wi-Fi network, wirelesstransmissions of an access terminal or an access point of a firstservice set may interfere with communication between an access terminaland a base station of a neighboring service set.

U.S. Patent Application Publication No. 2007/0105574, the disclosure ofwhich is hereby incorporated by reference, describes a system wherefair-sharing of a wireless channel may be facilitated by jointscheduling of a transmission by transmitting and receiving nodes throughthe use of a resource utilization message. Here, a transmitting node mayrequest a set of resources based on knowledge of resource availabilityin its neighborhood and a receiving node may grant the request based onknowledge of resource availability in its neighborhood. For example, thetransmitting node may determine channel availability by listening toreceiving nodes in its vicinity and the receiving node may determinepotential interference by listening to transmitting nodes in itsvicinity.

In the event the receiving node is subjected to interference fromneighboring transmitting nodes, the receiving node may transmit aresource utilization message in an attempt to cause the neighboringtransmitting nodes to limit their interfering transmissions. Accordingto related aspects, a resource utilization message may be weighted toindicate not only that a receiving node is disadvantaged (e.g., due tothe interference it sees while receiving) and desires a collisionavoidance mode of transmission, but also the degree to which thereceiving node is disadvantaged.

A transmitting node that receives a resource utilization message mayutilize the fact that it has received a resource utilization message, aswell as the weight thereof, to determine an appropriate response. Forexample, the transmitting node may elect to abstain from transmitting,may reduce its transmit power during one or more designated timeslots,may ignore the resource utilization message, or may respond in someother manner. The advertisement of the resource utilization messages andassociated weights may thus provide a collision avoidance scheme that isfair to all nodes in the system.

SUMMARY

A summary of sample aspects of the disclosure follows. It should beunderstood that any reference to the term aspects herein may refer toone or more aspects of the disclosure.

The disclosure relates in some aspects to determining whether to reactto a resource utilization message (hereafter referred to as a “RUM” forconvenience). For example, a first communication node may receive a RUMthat indicates that a second communication node (i.e., the RUM-sendingnode) wishes to use a communication resource during an upcomingtransmission opportunity. The first node (e.g., a potential interferingnode) may then determine whether it will take any action in response tothe received message. For example, the first node may elect to ignorethe message or obey the message. Here, obeying the message may involvelimiting transmission in some manner during the transmissionopportunity. For example, the first node may limit transmission byabstaining from transmitting, reducing transmit power, transmitting onanother resource, or taking some other suitable action.

In some aspects the manner in which a node determines whether to reactto a RUM may be adaptable. For example, a decision by a node to react ornot react to a RUM may be based on an adaptable decision parameter suchas a RUM rejection threshold or a probability parameter. In these cases,adapting a decision parameter may thus involve increasing or decreasingthe RUM rejection threshold or the probability parameter.

In some aspects, a decision parameter may be adapted based on one ormore received RUMs. For example, the decision parameter may be adaptedbased on how many RUM have been received, information included in a RUM,or a combination thereof. Information included in a RUM may comprise apriority (e.g., a weight) associated with the RUM, a channel conditionassociated with the RUM-sending node, an indication relating to thenumber of interferers seen by the RUM-sending node, or some other typeof information.

As an example, a RUM rejection threshold may be decreased in response toan increase in the number of RUMs received by a node and/or in responseto an increase in the weight of the received RUMs. By decreasing thethreshold in this way, an interfering node may be configured to react to(e.g., obey) more RUMs.

As another example, a probability parameter may be defined based on thecondition of a channel on which a RUM-sending node receives data from anassociated transmitting node. In this case, a potential interferer(i.e., an interfering node) may set its probability of obeying a RUMfrom the RUM-sending node to a relatively low value if the RUM-sendingnode has a relatively good channel to its associated transmitting node.As a result, the interferer may obey RUMs from the RUM-sending node at arelatively infrequent rate since it is more likely in this case that thetransmission from the interferer will not significantly interfere withthe reception at the RUM-sending node on that channel. Conversely, theprobability of obeying a RUM may be set to a relatively high value ifthe RUM-sending node has a relatively poor channel to its associatedtransmitting node. In this case, the interferer may obey more of theRUMs from the RUM-sending node since it is more likely that atransmission from the interferer will interfere with reception at theRUM-sending node under these circumstances.

A probability parameter may be adapted based on various types ofinformation in addition to the above channel condition information. Forexample, the probability of obeying a RUM may be defined to be inverselyproportional to the estimated power level (e.g., power spectral density)of an interfering signal at the RUM-sending node. In addition, theprobability of obeying a RUM from a given node may be decreased in theevent the interferer has recently obeyed a large number of RUMs fromthat node.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other sample aspects of the disclosure will be described inthe detailed description and the appended claims that follow, and in theaccompanying drawings, wherein:

FIG. 1 is a simplified diagram of several sample aspects of acommunication system;

FIG. 2 is a flowchart of several sample aspects of operations that maybe performed to adapt how a node reacts to received resource utilizationmessages;

FIG. 3 is a simplified block diagram of several sample aspects of acommunication system employing components configured to providefunctionality relating to adapting reactions to received resourceutilization messages;

FIG. 4 is a flowchart of several sample aspects of operations that maybe performed to provide a RUM;

FIG. 5 is a flowchart of several sample aspects of operations that maybe performed to determine whether to react to a received RUM;

FIG. 6 is a flowchart of several sample aspects of operations that maybe performed to adapt a RUM rejection threshold;

FIGS. 7A and 7B comprise a flowchart of several sample aspects ofoperations that may be performed to determine whether to obey a receivedRUM based on a probability;

FIG. 8 is a flowchart of several sample aspects of operations that maybe performed to classify received RUMs;

FIGS. 9A and 9B comprise a flowchart of several sample aspects ofoperations that may be performed to determine whether to obey a receivedRUM based on previously received RUMs;

FIG. 10 is a simplified block diagram of several sample aspects ofcommunication components; and

FIGS. 11-13 are simplified block diagrams of several sample aspects ofapparatuses configured to provide functionality relating to adapting atransmission decision parameter as taught herein.

In accordance with common practice the various features illustrated inthe drawings may not be drawn to scale. Accordingly, the dimensions ofthe various features may be arbitrarily expanded or reduced for clarity.In addition, some of the drawings may be simplified for clarity. Thus,the drawings may not depict all of the components of a given apparatus(e.g., device) or method. Finally, like reference numerals may be usedto denote like features throughout the specification and figures.

DETAILED DESCRIPTION

Various aspects of the disclosure are described below. It should beapparent that the teachings herein may be embodied in a wide variety offorms and that any specific structure, function, or both being disclosedherein is merely representative. Based on the teachings herein oneskilled in the art should appreciate that an aspect disclosed herein maybe implemented independently of any other aspects and that two or moreof these aspects may be combined in various ways. For example, anapparatus may be implemented or a method may be practiced using anynumber of the aspects set forth herein. In addition, such an apparatusmay be implemented or such a method may be practiced using otherstructure, functionality, or structure and functionality in addition toor other than one or more of the aspects set forth herein. Furthermore,an aspect may comprise at least one element of a claim. As an example ofthe above, in some aspects a method of wireless communication comprisesreceiving a set of RUMs, and adapting, based on the received set ofRUMs, a decision parameter that is used to determine whether to react toat least one received RUM. In addition, in some aspects the decisionparameter comprises a RUM rejection threshold and in some aspects thedecision parameter comprises a probability of reacting to the at leastone received RUM.

For illustration purposes, the discussion that follows describes variousnodes, components, and operations of a wireless system where an accesspoint communicates with one or more access terminals. It should beappreciated that the teachings herein also may be applicable to othertypes of nodes, devices, and communication systems (e.g., wireless ornon-wireless systems).

FIG. 1 illustrates several sample aspects of a wireless communicationsystem 100. The system 100 includes several wireless nodes, generallydesignated as wireless nodes 102 and 104. A given wireless node mayreceive and/or transmit one or more traffic flows (e.g., data flows).For example, each wireless node may comprise at least one antenna andassociated receiver and transmitter components. In the discussion thatfollows the term receiving node may be used to refer to a wireless nodethat is receiving and the term transmitting node may be used to refer toa wireless node that is transmitting. Such a reference does not implythat the wireless node is incapable of performing both transmit andreceive operations.

A wireless node may be implemented in various ways. For example, in someimplementations a wireless node may comprise an access terminal, a relaypoint, or an access point. Referring to FIG. 1, the wireless nodes 102may comprise access points or relay points and the wireless nodes 104may comprise access terminals. In some implementations the wirelessnodes 102 facilitate communication between the wireless nodes of anetwork (e.g., a Wi-Fi network, a cellular network, or a WiMAX network).For example, when an access terminal (e.g., an access terminal 104A) iswithin a coverage area of an access point (e.g., an access point 102A)or a relay point, the access terminal 104A may thereby communicate withanother device of the system 100 or some other network that is coupledto communicate with the system 100. Here, one or more of the wirelessnodes (e.g., wireless nodes 102B and 102D) may comprise a wired accesspoint that provides connectivity to another network or networks (e.g., awide area network 108 such as the Internet).

In some aspects two or more wireless nodes of the system 100 (e.g.,wireless nodes of a common independent service set) associate with oneanother to establish traffic flows between the wireless nodes via one ormore communication links. For example, the wireless nodes 104A and 104Bmay associate with one another via corresponding access points 102A and102C. Thus, one or more traffic flows may be established to and fromaccess terminal 104A via access point 102A and one or more traffic flowsmay be established to and from access terminal 104B via access point102C.

In some cases, several wireless nodes in the system 100 may attempt totransmit at the same time (e.g., during the same timeslot). Depending onthe relative locations of the transmitting and receiving nodes and thetransmit power of the transmitting nodes, it may be possible to reliablyconduct such concurrent communications. Under these circumstances, thewireless resources of the system 100 may be well utilized as comparedto, for example, a system that simply uses a carrier sense multipleaccess (“CSMA”) mode of operation.

Under other circumstances, however, wireless transmissions from a nodein the system 100 may interfere with reception at another wireless nodein the system 100 (e.g., a non-associated node of another communicationsector). For example, the wireless node 104B may be receiving from thewireless node 102C (as represented by a wireless communication symbol106A) at the same time that a wireless node 102D is transmitting to awireless node 104C (as represented by a symbol 106B). Depending on thedistance between the wireless nodes 104B and 102D and the transmissionpower of the wireless node 102D, transmissions from the wireless node102D (as represented by a dashed symbol 106C) may interfere withreception at the wireless node 104B. In a similar manner, transmissionsfrom the wireless node 104B may interfere with reception at the wirelessnode 102D depending on the transmission power of the wireless node 104B.

To mitigate interference such as this, the nodes of a wirelesscommunication system may employ an inter-node messaging scheme. Forexample, a receiving node that wishes to reduce the likelihood ofinterference may transmit a RUM to indicate that this receiving node isrequesting priority access to a given resource (e.g., because receptionat the node is disadvantaged in some way). A neighboring wireless nodethat receives the RUM (e.g., a potential interferer) may elect to limitits future transmissions in some way to avoid interfering with receptionat the RUM-sending node (i.e., the receiving node that sent the RUM).Here, a decision by a receiving node to transmit a RUM may be based, atleast in part, on quality of service associated with data received atthat receiving node. For example, a receiving node may transmit a RUM inthe event the current level of quality of service for one or more of itslinks or flows falls below a desired quality of service level.Conversely, the receiving node may not transmit a RUM if the quality ofservice is acceptable.

Sample RUM-related operations of a system such as the system 100 willnow be discussed in more detail in conjunction with the flowchart ofFIG. 2. For convenience, the operations of FIG. 2 (or any otheroperations discussed or taught herein) may be described as beingperformed by specific components (e.g., components of a system 300 asdepicted in FIG. 3). It should be appreciated, however, that theseoperations may be performed by other types of components and may beperformed using a different number of components. It also should beappreciated that one or more of the operations described herein may notbe employed in a given implementation.

As represented by block 202 of FIG. 2, when a wireless node is withincommunication range of another wireless node, the nodes may associatewith one another to establish a communication session. Moreover,different sets of nodes may associate with one another in a givenneighborhood. For example, one set of nodes (e.g., associated with anaccess point 102C in FIG. 1) may form one communication sector whileanother set of nodes (e.g., associated with an access point 102D) mayform a neighboring sector. Consequently, one or more traffic flows maybe established in the first sector from a transmitting node (e.g., node102C) to an associated receiving node (e.g., node 104B). In addition,one or more traffic flows may be established in the second sector from atransmitting node (e.g., node 102D) to an associated receiving node(e.g., node 104C).

As represented by block 204, at some point in time a transmitting node(e.g., node 102D) may receive one or more RUMs from one or morereceiving nodes (e.g., from non-associated node 104B). Here, a receivingnode may send a RUM in an attempt to reserve a resource for an upcomingtransmission opportunity. For example, the receiving node 104B mayrepeatedly (e.g., continually, periodically, etc.) monitor the qualityof service associated with data it receives from an associatedtransmitting node (e.g., node 102C). In the event the monitored qualityof service falls below a desired quality of service level (e.g., due tointerference from a non-associated transmitting node 102D), thereceiving node 104B may transmit a RUM in an attempt to reserve aresource and thereby improve the quality of service of its receiveddata.

As represented by block 206, the transmitting node may adapt atransmission decision parameter based on one or more of the receivedRUMs. A decision parameter may take various forms. For example, in somecases a decision parameter may comprise a RUM rejection threshold, whilein other cases a decision parameter may comprise a probability. Hence,adapting the decision parameter may involve raising or lowering a RUMrejection threshold or increasing or decreasing a probability value.Sample operations relating to a scenario where the adaptable decisionparameter comprises a RUM rejection threshold are described below inconjunction with FIGS. 5 and 6. Sample operations relating to a scenariowhere the adaptable decision parameter comprises a probability aredescribed below in conjunction with FIGS. 7A-9B.

As will be discussed in more detail below, a decision parameter may beadapted based on a RUM itself (e.g., the mere receipt of a RUM) and/orbased on information included in a RUM. Also, a decision parameter maybe adapted based a current RUM, one or more previously received RUMs, ora current RUM and one or more previously received RUMs. For example, insome cases a decision parameter may be based on the number of RUMs thatare received during a given period of time. In some cases a RUM maycomprise priority information whereby the decision parameter may bebased on this priority information. In some cases a RUM may include anindication of the condition of a channel between a RUM-sending node andits associated transmitting node, whereby the decision parameter may bebased on this indication. In some cases a RUM may comprise an indicationrelating to how many interfering nodes are seen by the RUM-sending node,whereby the decision parameter may be based on this indication. In somecases the decision parameter may be based on the number of received RUMsthat were obeyed.

As represented by block 208 of FIG. 2, the transmitting node uses thedecision parameter to determine whether to react to a received RUM. Asmentioned above, a decision to ignore a RUM or limit transmission inresponse to a received RUM may be based on, for example, comparison ofinformation derived from the received RUM with a RUM rejection thresholdor based on a probability that is, in turn, based on informationassociated with the received RUM. In addition, in some aspects such adecision may be based on a combination of factors (e.g., according to ahierarchy that defines an order in which the factors are considered).For example, as a first step, information may be compared with the RUMrejection threshold. In a second step, a probability based oninformation (e.g., a channel gain) received via the RUM may be employed.In a third step, a probability based on receipt of one or more RUMs(e.g., the number of received RUMS) may be employed.

A transmitting node may limit its transmission in various ways. Forexample, a node may limit transmission by abstaining from transmittingduring a transmission opportunity (e.g., delaying transmission byelecting to transmit during a later timeslot), reducing transmit power,reducing data transmission rate, using different coding, transmitting onanother resource (e.g., using a different frequency carrier), performingsome other suitable operation, or performing some combination or theabove.

With the above overview in mind, various aspects of RUM-relatedoperations and representative components that may perform theseoperations will now be described in more detail in conjunction withFIGS. 3-9B.

FIG. 3 illustrates sample components of a receiving node 302 and anon-associated transmitting node 304 that are close enough to oneanother such that transmissions from the node 304 may interference withreception at the node 302. Thus, the node 304 may be an interfering nodeto the node 302 and, as a result of this interference, the node 302 maybe a RUM-sending node. The nodes 302 and 304 include transceivers 306and 308, respectively, for communicating with other nodes. Thetransceivers 306 and 308 respectively include transmitters 310 and 312and receivers 314 and 316. Other components of the nodes 302 and 304will be described in conjunction with the discussion of FIGS. 4-9B thatfollows.

FIG. 4 describes sample operations that the receiving node 302 (e.g., anaccess point or access terminal) may perform in conjunction withreceiving data and generating RUMs. As represented by block 402, thereceiving node 302 (e.g., node 104B of FIG. 1) receives data from anassociated transmitting node (e.g., node 102C).

As represented by block 404, the receiving node 302 may determinewhether it is receiving data (e.g., one or more flows) in accordancewith a desired level of quality of service (“QoS”). Here, a desiredlevel of quality of service may relate to throughput (e.g., for fullbuffer traffic), latency (e.g., for voice traffic), average spectralefficiency, minimum carrier-to-interference ratio (“C/I”), or some othersuitable metrics or metrics. For example, it may be desirable for a nodeto receive data associated with a given type of traffic at or above agiven throughput rate (e.g., for video traffic), within a given latencyperiod (e.g., for voice traffic), or without significant interference.

In the example of FIG. 3, the receiving node 302 includes a QoSdeterminer 318 configured to analyze data received by the receiver 314to determine one or more quality of service-related parametersassociated with the data. Accordingly, the QoS determiner 318 maycalculate throughput of received data and/or calculate latency ofreceived data. In addition, the QoS determiner 318 may cooperate with aninterference determiner 320 to obtain, for example, an estimate of theamount of interference imparted on the received data. It should beappreciated that a QoS determiner may take other forms and that varioustechniques may be employed to monitor quality of service. For example,in some implementations a node may employ a sliding window scheme (e.g.,a short term moving average) to monitor the level of quality of serviceof its received data on a relatively continual basis.

In some aspects, a determination of whether a given level of quality ofservice is being achieved may be based on comparison of the quality ofservice information provided by the QoS determiner 318 with informationrepresentative of a desired quality of service (e.g., a quality ofservice threshold). For example, the QoS determiner 318 may generate aquality of service metric that indicates (e.g., provides an estimate of)the level of quality of service that is associated with received dataover a given time period, a given number of packets, and so on. Inaddition, one or more thresholds (e.g., a RUM sending threshold) maydefine an expected quality of service level for a given type of trafficor for several different types of traffic. The QoS determiner 318 maythus compare the current quality of service metric with a quality ofservice threshold to determine whether the desired quality of service isbeing met at block 404. If so, the receiving node 302 may continuereceiving data and monitoring the associated quality of service asrepresented by the arrow from block 404 to block 402 in FIG. 4.

On the other hand, if the quality of service is not acceptable at block404, the receiving node 302 may attempt to reserve a resource to improvethe quality of service for its received data (e.g., to reduceinterference on the resource the node 302 will use to receive data).Blocks 406-412 describe several operations that the receiving node 302may perform in conjunction with generating and transmitting a RUM.

As represented by block 406, the receiving node 302 (e.g., a prioritydeterminer 322) may determine a RUM priority that indicates, forexample, the degree to which the receiving node 302 is disadvantaged.Priority information associated with a RUM may take various forms. Forexample, in some cases priority information may take the form of aweighting factor (e.g., a weight indication that is included in theRUM). In some implementations a RUM weight may be defined as a quantizedvalue of a ratio of the desired quality of service (e.g., correspondingto a RUM-sending threshold) and a quality of service metric relating tothe quality of service that is actually achieved. Such a weightingfactor may be normalized to reduce the overhead of the weighting factor.For example, a weight may be represented by a few bits (e.g., two orthree bits). In some cases, priority may be indicated by the ordering ofRUMs (e.g., in time and/or frequency). For example, RUMs occurringearlier in time may be associated with a higher priority.

As represented by block 408, the receiving node 302 may optionallydetermine the condition of a channel to an associated transmitting node.For example, a channel analyzer 324 may cooperate with the transceiver306 to process signals received via the channel and thereby determineone or more channel characteristics such as channel gain (e.g.,corresponding to path loss of the channel). As will be described in moredetail below, this information may be used by an interfering node todetermine whether to react to a RUM that was sent in an attempt toreserve a resource that includes that channel.

As represented by block 410, the receiving node 302 may optionallydetermine the number of interferers that are affecting reception of dataat the node 302. As will be described in more detail below, thisinformation may be used to generate an indication that is broadcast bythe node 302 whereby nearby interfering nodes may determine whether toreact to a RUM based on the indication.

The number of interferers may be determined in various ways. Forexample, in some cases, the interference determiner 320 may cooperatewith the transceiver 306 to process signals received on a given channelto determine the number of non-associated transmitting nodes that aretransmitting on that channel. In some cases, the existence of one ormore interfering nodes may be identified based on a degradation inquality of service of received data (e.g., as evidenced by an increaseddata error rate), a lower signal-to-noise ratio on a given channel, orsome other condition.

As represented by block 412, the receiving node 302 (e.g., a RUMcontroller 326) generates RUM information and transmits (e.g.,broadcasts) the RUM in cooperation with the transceiver 306. The RUM mayinclude one more indications relating to the information described aboveon conjunction with blocks 406-410 (e.g., a priority indication, achannel condition indication, and an indication relating to the numberof interferers). In addition, in some cases a RUM may include otherinformation maintained by the node 302 (e.g., in a data memory 328) suchas a node identifier (“ID”) 330 or a sector identifier 332 (e.g.,identifying a particular base station or SSID). Also, in some cases thenode 302 may convey information by the manner in which a RUM istransmitted. For example, as mentioned above, the timing and/orfrequency characteristics of a RUM may indicate priority of that RUM.

In some aspects a RUM may be used to mitigate (e.g., clear) interferenceon one or more carriers. For example, in some cases each RUM relates toa single carrier (e.g., that is associated with a given frequency band).Here, whenever a wireless node wishes to clear interference on thatcarrier, the wireless node may transmit a RUM (e.g., via a time-divisionand/or frequency-division multiplexed control channel). In other cases,each RUM may relate to a set of carriers. For example, in somemulti-carrier systems a wireless node may transmit a RUM whenever itwishes to clear interference on all of the carriers. In othermulti-carrier systems a RUM may be clear a subset of the availablecarriers. For example, when a wireless node wishes to clear interferenceon a subset of the carriers, the wireless node may transmit a RUM inconjunction with an indication of the carrier(s) to which the RUMapplies. In such a case, the carrier indication may be included in theRUM.

A carrier indication may take various forms. For example, in some casesthe carrier indication may take the form of a set of bits where each bitcorresponds to a branch of a tree, and where each branch corresponds, inturn, to a carrier. For example, one bit may correspond to a firstcarrier, another bit may correspond to a set of carriers (e.g., whichmay include one or more carriers or sets of carriers). In other cases,the carrier indication may take the form of a bit mask. For example,each bit of the mask may correspond to a unique one of the carriers.

A RUM may take various forms. For example, in some cases a RUM mayconsist of a series of tones. In some cases different tones may coverdifferent frequency bands. In some cases the RUMs from different nodesmay be ordered in some manner (e.g., in time and/or frequency).

A RUM may be transmitted in various ways. In some cases a RUM may bebroadcast. In some cases a RUM may be transmitted at a known (e.g.,constant) power level (e.g., power spectral density). In some cases aRUM may be sent over one or more frequency division multiplexed channels(e.g., frequency multiplexed with respect to one or more data channels).In some cases a RUM may be sent over one or more time divisionmultiplexed channels (e.g., time multiplexed with respect to one or moredata channels).

FIGS. 5 and 6 describe sample operations that the transmitting node 304(e.g., an access point or access terminal) may perform in conjunctionwith using an adaptable RUM rejection threshold to determine whether toreact to a received RUM. FIG. 5 describes how the node 304 may use a RUMrejection threshold. FIG. 6 describes how the node 304 may adapt the RUMrejection threshold. Here, it should be appreciated that the term RUMrejection threshold is used for convenience and that a thresholddesignated in this manner may inherently be used as a RUM acceptance (orobey) threshold (e.g., by accepting that which would not be rejected).

As represented by block 502, at various points in time the node 304(e.g., node 102D of FIG. 1) will receive RUMs from one or moreneighboring nodes. For example, the node 304 may receive RUMs from oneor more associated receiving nodes (e.g., node 104C) or from one or morenon-associated receiving nodes (e.g., node 104B).

As represented by block 504, the node 304 may resolve any contentionbetween the received RUMs for a resource (e.g., use of a carrier duringa given timeslot or interlace) based on the priorities associated withthe RUMs. For example, if several nodes send RUMs for the same resource,the node that sent the RUM associated with the highest priority may begiven priority to use the resource.

As represented by block 506, if a node that wishes to receive from thenode 304 (i.e., node 304's associated receiving node) has the highestpriority, the node 304 may simply ignore the RUM. In this case, theneighboring interfering nodes may limit their transmissions since theirassociated receiving nodes did not win the contention for the resource.Since these interfering nodes will be cleared off the resource, the node304 will be free transmit to its receiving node using the resource onceit is scheduled to do so (e.g., by an access point).

In contrast, if a receiving node associated with the node 304 did nottransmit a RUM or did not transmit a RUM having the highest priority,the node 304 may perform operations as in block 508 to determine whetherto obey the highest weight RUM. Here, the node 304 may determine whetherits transmission (e.g., during a designated transmission opportunity)will interfere with reception at the RUM-sending node that sent thehighest weight RUM.

In some aspects, this determination may involve comparing a RUMrejection threshold with a value associated with (e.g., derived from)the received RUM. In other words, the node 304 may elect to obey orignore the RUM depending on whether this value is less than, great than,or equal to the threshold. For example, the RUM rejection threshold maybe defined as a value that represents the maximum allowable level ofinterference at the RUM-sending node. In this case, the node 304 mayestimate the amount of interference its transmission would cause at theRUM-sending node. The node 304 (e.g., a received RUM analyzer 334) maythus compare this interference estimate value with the RUM rejectionthreshold at block 510. If the value is less than (or less than or equalto) the threshold—thereby indicating that the interference will fallbelow a specified level—the node 304 may elect to ignore the RUM (block512). Otherwise, the node 304 may elect to obey the RUM (block 514).

The interference estimate may be generated in various ways. For example,as mentioned above, a RUM may be transmitted at a known power level.Moreover, the RUM may be transmitted over a control channel that has arelatively low reuse factor (e.g., 1/10 or less) so that a RUMtransmission tends to experience a noise-limited channel as opposed toan interference-limited channel. As a result, the received signalstrength of the RUM may be proportional to the signal-to-noise ratio,and thereby serve as a surrogate measure for detectability of the RUM. Achannel analyzer 336 of the node 304 (e.g., in cooperation with thetransceiver 308) may thus determine the path loss to the RUM-sendingnode by, for example, measuring the power of the received RUM. Based onthis path loss information and the known transmitting power of thetransmitter 312, the node 304 may estimate the level of interference itstransmission will cause at the RUM-sending node.

Referring now to FIG. 6, as mentioned above, a RUM rejection thresholdmay be adapted based on one or more received RUMs. Accordingly, asrepresented by block 602, the node 304 may acquire a set of one or moreRUMs over a defined period of time (e.g., defined as one or moretimeslots, one or more interlaces, etc.). In some cases, the set of RUMsmay consist of or include the latest received RUM (e.g., the RUM thatthe node 304 is currently determining whether to obey).

As represented by block 604, the node 304 (e.g., the received RUManalyzer 334) may optionally determine whether there has been a largenumber or small number (or an increase or a decrease in the number) ofRUMs received over the defined period of time. The node 304 maydetermine the number of received RUMs in various ways. For example, thenode 304 may employ a sliding window (of a duration equal to the definedperiod of time) and maintain a count 338 of the number of RUMs receivedduring each instance of the window in a data memory 340.

As represented by block 606, the node 304 (e.g., the received RUManalyzer 334) may optionally determine whether there have been higher orlower (or an increase or a decrease in) priorities associated with theRUMs received over the defined period of time. The node 304 maydetermine the priorities associated with the received RUMs in variousways. For example, the node 304 may employ a sliding window (of aduration equal to the defined period of time) and maintain a list 342 ofthe priorities associated with the RUMs received during each instance ofthe window.

In some aspects, the node 304 may track RUMs from a specified subset ofnodes or may track RUMs having a particular characteristic. For example,in some cases the node 304 may track the RUMs from a node that has(e.g., on average) the highest priority RUMs (e.g., to monitor anytrends in the weights from that node). In addition, in some cases thenode 304 may track the highest weight RUMs (e.g., to monitor any trendsin the highest received weights).

As represented by block 608, the node 304 may adapt a RUM rejectionthreshold based on the received RUMs. For example, a RUM rejectionthreshold (“RRT”) definer 344 of a decision parameter adapter 346 mayadjust the RUM rejection threshold based on the RUM quantity or priorityinformation obtained at blocks 604 and 606.

As a more specific example, if there has been a large number (or anincrease in the number) of received RUMs, the RUM rejection thresholdmay be adapted (e.g., decreased) so that the node 304 is more likely toobey a received RUM. Conversely, if there has been a small number (or adecrease in the number) of received RUMs, the RUM rejection thresholdmay be adapted (e.g., increased) so that the node 304 is less likely toobey a received RUM.

Similarly, if the node 304 has received relatively high (or seen anincrease in) priority values, the RUM rejection threshold may be adapted(e.g., decreased) so that the node 304 is more likely to obey a receivedRUM. Conversely, if the node 304 has received low (or seen a decreasein) priority values, the RUM rejection threshold may be adapted (e.g.,increased) so that the node 304 is less likely to obey a received RUM.

The node 304 may employ various techniques to characterize the number(or a change in the number) of received RUMs. For example, in some casesthe node 304 may compare the number of received RUMs with a thresholdnumber of RUMs. In addition, in some cases the node 304 may determinewhether there is some sort of trend (e.g., an increase or decrease) inthe number of received RUMs over a period of time. In other words, thenode 304 may track the evolution of the number of RUMs received so thatthe adaptation of the RUM rejection threshold is done on a slower timescale (e.g., not based on every RUM received or the absence of RUMs overa very short time period).

The node 304 also may employ various techniques to characterize thevalues (or a change in the values) of the RUM priorities. For example,in some cases the node 304 may compare the priorities with a thresholdpriority level. In addition, in some cases the node 304 may determinewhether there is some sort of trend (e.g., an increase or decrease) inthe priority values over a period of time. Thus, the node 304 also maytrack the evolution of the priorities so that the adaptation of the RUMrejection threshold is done on a slower time scale.

Equation 1 illustrates an example of how a RUM rejection threshold maybe adapted based on the number of received RUMS. In Equation 1, RRT isdecremented by a value ΔT (down to a minimum defined RRT value) if twoor more RUMs are received. Conversely, RRT is incremented by the valueΔT (up to a maximum defined RRT value) if less than two RUMs arereceived. It should be appreciated that similar techniques may beemployed for RUM priorities. In addition, it should be appreciated thatdifferent algorithms may be used to adapt a RUM rejection threshold.

$\begin{matrix}{{{RRT}\left( {n + 1} \right)} = \left\{ \begin{matrix}{{\max\left( {{{{RRT}(n)} - {\Delta\; T}},{RRT}_{\min}} \right)},} & {{if} \geq {2\mspace{14mu}{received}\mspace{14mu}{RUMs}}} \\{{\min\left( {{{{RRT}(n)} + {\Delta\; T}},{RRT}_{\max}} \right)},} & {otherwise}\end{matrix} \right.} & (1)\end{matrix}$

The adaptation of the RUM rejection threshold may be based on specifiedRUMs (e.g., a subset of the received RUMs). For example, in some casesthe node 304 may adapt the threshold based only on the RUMs having thehighest priorities. In some cases the node 304 may adapt the thresholdbased only on the RUMs received from a specified node (e.g., the nodehaving the highest priority RUMs). For example, the node 304 may adaptthe threshold based on an increase or decrease in the weights from asubset of the nodes (e.g., the specified node) rather than adapting thethreshold based on, for example, an increase or decrease in the averageweight of the RUMs received from all nodes.

Referring now to FIGS. 7A-9B, sample operations that the transmittingnode 304 may perform in conjunction with using a probability decisionparameter to determine whether to react to a received RUM will now betreated. FIGS. 7A and 7B describe an example of how the node 304 maydefine (e.g., adapt) and use a probability parameter based on one ormore channel conditions. FIG. 8 describes an example of how the node 304may classify and maintain received RUM information. FIGS. 9A and 9Bdescribe an example of how the node 304 may define (e.g., adapt) and usea probability parameter based on received RUM information.

As represented by block 702 of FIG. 7A, the node 304 receives RUMs fromone or more neighboring nodes. As mentioned above, a given RUM mayattempt to reserve resources for one or more upcoming transmissionopportunities (e.g., timeslots). In addition, as discussed above inconjunction with block 412, a RUM may include one or more indicationsrelating to a condition of a channel, priority, a number of interferers,a node identifier, or a sector identifier.

As represented by blocks 704 and 706, the node 304 may resolve anycontention between the received RUMs for a resource based on thepriorities associated with the RUMs. Again, if the RUM from a receivingnode for the node 304 has the highest priority, the node 304 may simplyignore the RUM. Otherwise, the operational flow proceeds to blocks708-718 where the node 304 determines whether to obey the highestpriority RUM from some other receiving node.

As represented by block 708, the node 304 (e.g., the channel analyzer336) may determine the condition of the channel between the node 304 andthe RUM-sending node associated with the highest priority. Here, achannel condition may relate to channel gain or some other parameter.For example, as mentioned above, a RUM may be transmitted at a knownpower level over a relatively noise-limited channel. The channelanalyzer 336 (e.g., in cooperation with the transceiver 308) may thusdetermine the path loss over the channel to the RUM-sending node by, forexample, measuring the power of the received RUM. Based on this pathloss information, the node 304 may estimate the channel gain of thechannel between the node 304 and the RUM-sending node.

As represented by block 710, the node 304 may define (e.g., adapt) aprobability parameter based on one or more channel conditions associatedwith the RUM-sending node. In the example of FIG. 3, the probability maybe defined by a probability definer 348 of the decision parameteradapter 346.

As discussed above in conjunction with block 408, one form of channelcondition may relate to a channel over which a transmitting node sendsdata to an associated receiving node (e.g., a RUM-sending node). Forexample, if a RUM-sending node has a good channel to its associatedtransmitting node, transmissions by a non-associated transmitting nodethat is relatively far (e.g., taking its transmit power into account)from the RUM-sending node will probably not cause significantinterference at the RUM-sending node. Consequently, the non-associatedtransmitting node may be allowed to ignore the RUMs from the RUM-sendingnode in this case.

Conversely, if a RUM-sending node has a poor channel to its associatedtransmitting node, it is more likely that transmissions of anon-associated transmitting node will cause interference at theRUM-sending node. Thus, in this case, it may be desirable for thenon-associated transmitting node to obey the RUMs from the RUM-sendingnode even if the non-associated transmitting node is not relativelyclose (e.g., taking its transmit power into account) to the RUM-sendingnode.

In some aspects, a channel condition (e.g., a good channel or a poorchannel) may be characterized by a channel gain of the channel. Thus, asdescribed above in conjunction with FIG. 4, a probability may be basedon a channel condition indication included in the RUM. For example, theprobability of obeying a RUM may change in an indirect manner inresponse to any changes in the channel gain of a channel between theRUM-sending node and its transmitting node. For example, an increase inthis channel gain may lead to an decrease in the probability.

In some aspects, a probability also may be based on the condition (e.g.,channel gain) of a channel between the RUM-sending node and aninterfering node (e.g., a non-associated transmitting node) thatreceived a RUM from the RUM-sending node. Here, the probability ofobeying a RUM may change in a direct manner in response to any changesin the channel gain of a channel between the RUM-sending node and aninterfering node. For example, an increase in this channel gain may leadto an increase in the probability.

In some aspects, a probability may be based on the relative channelconditions (e.g., channel gains) of the two channels described above.For example, a decision to obey a RUM may be based on how good of achannel a RUM-sending node has to its associated transmitting node ascompared to how much interference the RUM-sending node may see on achannel from a non-associated interfering node. An example of analgorithm that may be used to define such a probability is set forth inEquation 2.P _(kj)=1−min(1,max(0,log₁₀(h _(jj) /h _(kj))))  (2)

Here, P_(kj) is the probability of a node k obeying a RUM from a node j,h_(jj) is the channel gain from node j to its transmitting node, andh_(kj) is the channel gain from node k to node j. The parameter h_(jj)may be included in the RUM sent by node j. From Equation 2 it may beseen that P_(kj) is close to zero if the relative magnitude of h_(jj) islarge with respect to the magnitude of h_(kj). Thus, node k will be lesslikely to obey a RUM as the channel condition h_(jj) improves relativeto the channel condition h_(kj). Conversely, the probability P_(kj) isclose to one if the relative magnitude of h_(jj) is small with respectto the magnitude of h_(kj). Thus, in this case, node k will be morelikely to obey a RUM as the channel condition h_(jj) deterioratesrelative to the channel condition h_(kj).

In some cases (e.g., on a reverse link from an access terminal to anaccess point) reception at a receiving node may be adversely affected bytransmissions from a relatively large number of interfering nodes thatcollectively cause a low signal-to-noise ratio for received data at thereceiving node. Here, the use of a probability-based RUM obey schemewill generally result in a subset of the nodes that receive a RUM fromthe receiving node obeying the RUM (e.g., as a result of the uniqueprobability-based decisions made by each node). Consequently, wherethere are a large number of interferers, the transmissions by theinterfering nodes that did not obey the RUM may still collectively causean undesirable level of interference at the receiving node.

Accordingly, in some cases a decision to react to a RUM may be based onthe number of interferers seen by a receiving node (i.e., theRUM-sending node). For example, an interfering node may employ a higherprobability for obeying a RUM if the RUM-sending node sees a largenumber of interferers and may employ a lower probability for obeying aRUM if the RUM-sending node sees a small number of interferers.

In some cases, a RUM-sending node may include information in a RUMindicative of the number (e.g., the fraction) of interfering nodes thatshould obey the RUM. For example, the RUM may include an index into alook-up table of functions. Any nodes that receive the RUM may then usethis index indication to determine the function to be used to determinewhether to obey the RUM (e.g., to determine a probability of obeying theRUM).

An example of an algorithm that may be used to define a probabilitybased on such an indication provided by a RUM is set forth in Equation3. Such an algorithm may be used instead of the algorithm of Equation 2.P _(kj)=exp(n*(a−1))  (3)

-   -   where a=min(1, h_(kj)/h_(jj))

Here, the parameter n may be used to control the number of transmittingnodes that obey a RUM. For example, higher values of n result in a lowerprobability P_(kj) of obeying a RUM (i.e., P_(kj) is closer to zero),and vice versa. In some cases, the value for n in Equation 3 may bebased on (e.g., comprise the inverse of) the number of interferers seenby node j. Thus, if there are more interferers (resulting in a lowervalue for n), a node that receives a RUM including the indication n willbe more likely to obey the RUM.

In some cases, such an indication may comprise one of a set of definednumbers. For example, RUMs that attempt to clear a forward link may useone value (e.g., 3) for the indication while RUMs that attempt to cleara reverse link may use a different value (e.g., 0.1) for the indication.Such a scheme may be used, for example, in cases where it is known orexpected that different links will typically have different numbers ofpotential interferers.

Referring now to FIG. 7B, as represented by block 712, the node 304 maydetermine whether to react to the received RUM based on the probability.For example, a transmission controller 350 may generate a random number(e.g., from zero to one) and compare the number to the probabilitydefined at block 710. If the random number is greater than theprobability at block 714, the node 304 may ignore the RUM (block 716).Otherwise, the node 304 may obey the RUM (block 718).

In some aspects, a probability of reacting to a RUM may be based onpreviously received RUMs. For example, a RUM-sending node may employ acriteria for sending RUMs that results in the transmission of more RUMsthan is warranted under the circumstances (e.g., from a systemperformance perspective). As a result, a transmitting node may receive alarge number of RUMs from that RUM-sending node. To avoid giving toomuch priority to the RUMs from the RUM-sending node, the transmittingnode may reduce the probability with which it obeys RUMs from anyRUM-sending node that sends a large number of RUMs.

In some aspects a probability of reacting to a RUM may be based on thenumber of RUMs received from a specified class of RUM-sending nodes. Forexample, in some cases a transmitting node may classify RUMs it receivesbased on the identity of each node that sent a RUM. As discussed above,this information may be indicated by a node identifier included in theRUM. Through the use of this information, a transmitting node mayreadily identify RUMs from a particular node to determine, for example,whether that nodes is sending too many RUMs.

In some cases a transmitting node may classify RUMs it receives based onthe sector of each node that sent a RUM. This information may beindicated by a sector identifier included in the RUM or in some othermanner (e.g., based on the location of the node and signaling associatedwith the RUM). In these cases, a transmitting node may readily identifyRUMs from a particular sector to determine, for example, whether thenodes in that sector are sending too many RUMs.

In some cases, however, a RUM may not include an identifier. Forexample, it may be desirable to keep the number of bits in the RUM to aminimum to reduce the overhead (e.g., power and bandwidth) associatedwith transmission of RUMs. In such a case, RUMs may be classified basedon the power level of each received RUM, the priority associated witheach received RUM, or some other characteristic associated with a RUM ornode. For example, it may be assumed that any received RUMs that have areceived power level that falls within a certain range may haveoriginated from the same node (or a relatively small subset of nodes).Consequently, this classification scheme may be used to determine, forexample, whether the node or nodes in this group are sending too manyRUMs.

FIG. 8 illustrates sample operations that may be performed to classifyreceived RUMs. In this example, the node 304 classifies the RUMs thathave been obeyed.

As represented by block 802, upon receipt of each RUM, the node 304determines whether to obey the RUM. Thus, the operation of block 802 maycorrespond to the operations described above in conjunction with FIG. 7.

As represented by block 804, for each RUM that has been obeyed, the node304 (e.g., a classifier 352) classifies the RUM based on one or moreclassification factors. For example, as discussed above, the classifier352 may classify each RUM based on the identity of the node that sentthe RUM, an associated sector, a received power level, or an associatedpriority.

As represented by block 806, the node 304 may maintain informationrelating to the classified RUMs in a data memory 354. For example, thenode 304 may maintain an indication of whether the last received RUM foreach classification (e.g., bin) was obeyed or may maintain counts of thenumber of obeyed RUMs for each classification. For example, a set ofnode identifier classes 356 may include one entry for one node, anotherentry for another node, and so on. In a similar manner, a set of sectoridentifier classes 358 may include multiple entries for differentsectors. A set of power classes 360 may include multiple entries fordifferent power ranges. For example, a first classification maycorrespond to a power level in a range of 0-0.9, a second classificationmay correspond to power level in a range of 1.0-1.9, and so on. A set ofpriority classes 362 may include multiple entries for differentpriorities (e.g., a weight of 1, a weight of 2, and so on).

Such information may be maintained in various ways. For example, in somecases each entry in a bin may expire (e.g., be removed from the bin)after a certain period of time. Also, in some cases a bin that maintainsa count may have a fixed size.

FIGS. 9A and 9B illustrate sample operations that may be performed todetermine whether to react to a RUM based on previously received RUMs.This example illustrates a two-step process where the node 304 makes apreliminary determination at blocks 904-908 regarding whether thereceived RUM should be obeyed (e.g., based on the techniques describedin FIG. 7) and then makes a final determination at blocks 910-920 as towhether the received RUM should be obeyed based on the number of RUMs(e.g., of the same class as the received RUM) that have been obeyed. Itshould be appreciated, however, that a determination of whether to reactto a RUM based on previously received RUMs need not employ thispreliminary determination.

As represented by block 902, the operations of FIGS. 9A and 9B mayinvolve operating on a RUM that has the highest priority and that is notfrom the node 304's associated receiving node. Thus, the operations ofblock 902 may be similar to the operations of blocks 702-706 discussedabove.

As represented by the optional blocks 904-908, the node 304 performsoperations such as those described at blocks 708-716 to make apreliminary determination as to whether to obey the received RUM basedon one or more channel conditions, the number of interferes, or someother criteria. If a decision is made to not obey the RUM at block 906,the node 304 may not make any further determination based on previouslyreceived RUMs. Conversely, if a preliminary decision to obey the RUM ismade at block 906, the operational flow may proceed to block 910.

As represented by block 910, the node 304 (e.g., the classifier 352)classifies the received RUM. For example, as discussed above the RUM maybe classified based on an associated node identity, sector identity,power level, priority, and so on.

As represented by block 912, the node 304 (e.g., the probability definer348) determines a probability of reacting to the received RUM based onthe number of RUMS of the same class as the received RUM that nave beenobeyed (e.g., over a defined period of time). Equation 4 illustrates anexample of an algorithm that may be employed to define such aprobability.P ^(j)(n)=1−R ^(j)(n)  (4)

-   -   where R^(j)(n+1)=a*R^(j)(n)+(1−a)*I{obey a RUM of same class}

Here, P^(j)(n) is the probability of obeying a RUM associated with aclass j (e.g., a bin j). For example, as discussed above, a probabilityP^(j)(n) may be defined to determine whether to react to RUMs from anode j, from a sector j, from a power level class j (e.g., acorresponding range), from a priority class j (e.g., a correspondingrange), and so on. In this example, P^(j)(n) is adapted by calculating anew value for R^(j)(n+1) (e.g., upon receipt of each RUM for class j).

The parameter a (e.g., a number between 0 and 1) affects how quicklyR^(j)(n+1) changes. Thus, this parameter may affect the number of RUMsof a given class that are obeyed (or ignored) in succession.

The indicator function I{ } is used to indicate whether a prior RUM hasbeen obeyed. For example, in some cases I{ } is equal to 1 if a RUMassociated with bin j was obeyed and is equal to 0 otherwise. Here, theparticular RUM operated on by the indicator function I{ } may be thelast RUM for which a decision to obey or ignore was made. Alternatively,the indicator function I{ } may generate a result based on some otherRUM or a plurality of RUMs (e.g., a set of RUMs received over a periodof time).

From Equation 4 it may be observed that the value of R^(j)(n) is basedon the number of RUMs of a particular class (e.g., from a specific node)that have been received. Moreover, in this particular example, R^(j)(n)is based on the number of obeyed RUMs for class j. In some respects,R_(j)(n) relates to a running average of the received RUMs for node jthat are obeyed (e.g., a percentage of obeyed RUMs over a period oftime). It should be appreciated based on the teachings herein that sucha parameter may be based on some other criterion or criteria and maycalculated in various ways (e.g., based on some other algorithm).

In some aspects, the parameters of Equation 4 are interrelated. Forexample, R^(j)(n+1) may increase if a previous RUM was obeyed.Consequently, P^(j)(n) may decrease in this case. Thus, the probabilityof a transmitting node obeying a RUM will decrease if a previous RUM wasobeyed. However, as P^(j)(n) approaches zero, fewer RUMs will be obeyed.This, in turn may cause R^(j)(n+1) to decrease.

In some cases, Equation 4 may be modified to change the steady stateprobability of obeying a RUM. That is, the normal steady stateprobability of obeying a RUM from a node that continually sends RUMs maybe 0.5. If desired, however, this steady state probability may bemodified to cause the algorithm to obey more RUMs or fewer RUMs, onaverage. Equation 5 illustrates an example of how P^(j)(n) may bemodified in this regard.P ^(j)(n)=q*(1−R ^(j)(n))  (5)

In this example, the steady state probability of obeying a RUM for classj may be p^(j)=1/(1+q). Thus, a node may be configured to obey more RUMsby making q smaller.

Referring now to FIG. 9B, as represented by block 914, the node 304determines whether to react to the received RUM based on the aboveprobability. For example, the transmission controller 350 may generate arandom number (e.g., from zero to one) and compare that number to theprobability defined at block 912. If the random number is greater thanthe probability at block 916, the node 304 may ignore the RUM (block918). Otherwise, the node 304 may obey the RUM (block 920).

As represented by block 922, the node 304 may then update theclassification information to indicate whether the RUM was obeyed. Thus,this operation may involve operations that are similar to thosedescribed above for block 806.

From the above, it may be seen that a probability may be defined (e.g.,adapted) based on one or more values associated with (e.g., derivedfrom) a received RUM itself and/or information included in a RUM. Forexample, the probability may be defined based on the channel conditionincluded in the received RUM. In addition, the probability may bedefined based on a channel condition derived from the received power ofthe RUM. Also, the probability may be defined based on an indicationincluded in the RUM relating to a number of interferers. Moreover, theprobability may be defined based on the number of received RUMs. Itshould be appreciated based on the teachings herein that a probabilityrelating to whether to react to a RUM or some other similar message orcondition may be based on another factor or factors. In addition, such aprobability may be based on a combination of one or more factors.

A probability-based decision to obey or ignore RUMs may be implementedin various ways when multiple RUMs are received. For example, in someaspects a random probability (e.g., a coin toss) may be made for eachreceived RUM independently. In some aspects, one of the probabilitiescalculated for the received RUMs may be selected. The selectedprobability may then be used to determine whether to obey or ignore eachof the received RUMs. For example, in some cases the maximum obeyprobability of the various obey probabilities determined for each of thereceived RUMs may be selected. In some cases, the probability associatedwith a received RUM having a certain characteristic (e.g., a RUMcharacteristic as described herein such as the highest priority, thehighest weight, and so on) may be selected.

In some aspects, a decision to obey or ignore a RUM may be based on acombination of any of the factors described herein. For example, adecision hierarchy may be employed where a decision is made at eachlevel of the hierarchy. A RUM may then be obeyed if each of thesedecisions is satisfied. A non-limiting example follows. As a first step,an estimated interference value based on the received power of a RUM maybe compared with a RUM rejection threshold (e.g., as described at FIG.5). If the first step provides a preliminary indication to obey the RUM(e.g., the estimated interference exceeds the RUM rejection threshold),a second step is performed. Otherwise, the RUM may be ignored. At thesecond step, a probability based on a channel gain indication receivedvia the RUM may be employed to determine whether to obey the RUM (e.g.,as described at FIGS. 7A and 7B). If the second step provides apreliminary indication to obey the RUM (e.g., the random number is lessthan the channel gain-based probability), a third step is performed.Otherwise, the RUM may be ignored. In the third step, a probabilitybased on tracked messages (e.g., the number of received RUMS) may beemployed to determine whether to obey the RUM (e.g., as described atFIGS. 9A and 9B). If the third step also indicates that the RUM shouldbe obeyed (e.g., the random number is less than the classification-basedprobability), the RUM is obeyed. Otherwise, the RUM may be ignored.

The teachings herein may be incorporated into a device employing variouscomponents for communicating with at least one other wireless device.FIG. 10 depicts several sample components that may be employed tofacilitate communication between devices. Here, a first device 1002(e.g., an access terminal) and a second device 1004 (e.g., an accesspoint) are adapted to communicate via a wireless communication link 1006over a suitable medium.

Initially, components involved in sending information from the device1002 to the device 1004 (e.g., a reverse link) will be treated. Atransmit (“TX”) data processor 1008 receives traffic data (e.g., datapackets) from a data buffer 1010 or some other suitable component. Thetransmit data processor 1008 processes (e.g., encodes, interleaves, andsymbol maps) each data packet based on a selected coding and modulationscheme, and provides data symbols. In general, a data symbol is amodulation symbol for data, and a pilot symbol is a modulation symbolfor a pilot (which is known a priori). A modulator 1012 receives thedata symbols, pilot symbols, and possibly signaling for the reverselink, and performs modulation (e.g., OFDM or some other suitablemodulation) and/or other processing as specified by the system, andprovides a stream of output chips. A transmitter (“TMTR”) 1014 processes(e.g., converts to analog, filters, amplifies, and frequency upconverts)the output chip stream and generates a modulated signal, which is thentransmitted from an antenna 1016.

The modulated signals transmitted by the device 1002 (along with signalsfrom other devices in communication with the device 1004) are receivedby an antenna 1018 of the device 1004. A receiver (“RCVR”) 1020processes (e.g., conditions and digitizes) the received signal from theantenna 1018 and provides received samples. A demodulator (“DEMOD”) 1022processes (e.g., demodulates and detects) the received samples andprovides detected data symbols, which may be a noisy estimate of thedata symbols transmitted to the device 1004 by the other device(s). Areceive (“RX”) data processor 1024 processes (e.g., symbol demaps,deinterleaves, and decodes) the detected data symbols and providesdecoded data associated with each transmitting device (e.g., device1002).

Components involved in sending information from the device 1004 to thedevice 1002 (e.g., a forward link) will be now be treated. At the device1004, traffic data is processed by a transmit (“TX”) data processor 1026to generate data symbols. A modulator 1028 receives the data symbols,pilot symbols, and signaling for the forward link, performs modulation(e.g., OFDM or some other suitable modulation) and/or other pertinentprocessing, and provides an output chip stream, which is furtherconditioned by a transmitter (“TMTR”) 1030 and transmitted from theantenna 1018. In some implementations signaling for the forward link mayinclude power control commands and other information (e.g., relating toa communication channel) generated by a controller 1032 for all devices(e.g. terminals) transmitting on the reverse link to the device 1004.

At the device 1002, the modulated signal transmitted by the device 1004is received by the antenna 1016, conditioned and digitized by a receiver(“RCVR”) 1034, and processed by a demodulator (“DEMOD”) 1036 to obtaindetected data symbols. A receive (“RX”) data processor 1038 processesthe detected data symbols and provides decoded data for the device 1002and the forward link signaling. A controller 1040 receives power controlcommands and other information to control data transmission and tocontrol transmit power on the reverse link to the device 1004.

The controllers 1040 and 1032 direct various operations of the device1002 and the device 1004, respectively. For example, a controller maydetermine an appropriate filter, reporting information about the filter,and decode information using a filter. Data memories 1042 and 1044 maystore program codes and data used by the controllers 1040 and 1032,respectively.

FIG. 10 also illustrates that the communication components may includeone or more components that perform operations relating to adaptivedecisions as taught herein. For example, a RUM control component 1046may cooperate with the controller 1040 and/or other components of thedevice 1002 to send and receive signals to another device (e.g., device1004) as taught herein. Similarly, a RUM control component 1048 maycooperate with the controller 1032 and/or other components of the device1004 to send and receive signals to another device (e.g., device 1002).It should be appreciated that for each device 1002 and 1004 thefunctionality of two or more of the described components may be providedby a single component. For example, a single processing component mayprovide the functionality of the RUM control component 1046 and thecontroller 1040 and a single processing component may provide thefunctionality of the RUM control component 1048 and the controller 1032.

The teachings herein may be incorporated into (e.g., implemented withinor performed by) a variety of apparatuses (e.g., devices). For example,each node may be configured, or referred to in the art, as an accesspoint (“AP”), NodeB, Radio Network Controller (“RNC”), eNodeB, BaseStation Controller (“BSC”), Base Transceiver Station (“BTS”), BaseStation (“BS”), Transceiver Function (“TF”), Radio Router, RadioTransceiver, Basic Service Set (“BSS”), Extended Service Set (“ESS”),Radio Base Station (“RBS”), or some other terminology. Certain nodesalso may be referred to as access terminals. An access terminal also maybe known as a subscriber station, a subscriber unit, a mobile station, aremote station, a remote terminal, a user terminal, a user agent, a userdevice, or user equipment. In some implementations an access terminalmay comprise a cellular telephone, a cordless telephone, a SessionInitiation Protocol (“SIP”) phone, a wireless local loop (“WLL”)station, a personal digital assistant (“PDA”), a handheld device havingwireless connection capability, or some other suitable processing deviceconnected to a wireless modem. Accordingly, one or more aspects taughtherein may be incorporated into a phone (e.g., a cellular phone or smartphone), a computer (e.g., a laptop), a portable communication device, aportable computing device (e.g., a personal data assistant), anentertainment device (e.g., a music or video device, or a satelliteradio), a global positioning system device, or any other suitable devicethat is configured to communicate via a wireless medium.

As mentioned above, in some aspects a wireless node may comprise anaccess device (e.g., a cellular or Wi-Fi access point) for acommunication system. Such an access device may provide, for example,connectivity for or to a network (e.g., a wide area network such as theInternet or a cellular network) via a wired or wireless communicationlink. Accordingly, the access device may enable another device (e.g., aWi-Fi station) to access the network or some other functionality.

A wireless node may thus include various components that performfunctions based on data transmitted by or received at the wireless node.For example, an access point and an access terminal may include anantenna for transmitting and receiving signals (e.g., messages relatingto control and/or data). An access point also may include a trafficmanager configured to manage data traffic flows that its receiverreceives from a plurality of wireless nodes or that its transmittertransmits to a plurality of wireless nodes. In addition, an accessterminal may include a user interface configured to output an indicationbased on received data.

A wireless device may communicate via one or more wireless communicationlinks that are based on or otherwise support any suitable wirelesscommunication technology. For example, in some aspects a wireless devicemay associate with a network. In some aspects the network may comprise alocal area network or a wide area network. A wireless device may supportor otherwise use one or more of a variety of wireless communicationtechnologies, protocols, or standards such as, for example, CDMA, TDMA,OFDM, OFDMA, WiMAX, and Wi-Fi. Similarly, a wireless device may supportor otherwise use one or more of a variety of corresponding modulation ormultiplexing schemes. A wireless device may thus include appropriatecomponents (e.g., air interfaces) to establish and communicate via oneor more wireless communication links using the above or other wirelesscommunication technologies. For example, a device may comprise awireless transceiver with associated transmitter and receiver components(e.g., transmitters 310 and 312 and receivers 314 and 316) that mayinclude various components (e.g., signal generators and signalprocessors) that facilitate communication over a wireless medium.

The components described herein may be implemented in a variety of ways.Referring to FIGS. 11-13, apparatuses 1100, 1200, and 1300 arerepresented as a series of interrelated functional blocks that mayrepresent functions implemented by, for example, one or more integratedcircuits (e.g., an ASIC) or may be implemented in some other manner astaught herein. As discussed herein, an integrated circuit may include aprocessor, software, other components, or some combination thereof.

The apparatuses 1100, 1200, and 1300 may include one or more modulesthat may perform one or more of the functions described above withregard to various figures. For example, an ASIC for receiving 1102 or1202 may correspond to, for example, a receiver as discussed herein. AnASIC for adapting a decision parameter 1104 may correspond to, forexample, a decision parameter adapter as discussed herein. An ASIC forderiving an interference indication 1106 may correspond to, for example,a channel analyzer as discussed herein. An ASIC for limiting or fordetermining whether to limit transmission 1108 may correspond to, forexample, a transmission controller as discussed herein. An ASIC fordetermining whether to react 1204 may correspond to, for example, atransmission controller as discussed herein. An ASIC for estimatingchannel gain 1206 may correspond to, for example, a channel analyzer asdiscussed herein. An ASIC for adapting a probability 1208 may correspondto, for example, a decision parameter adapter as discussed herein. AnASIC for determining acceptable QoS 1302 may correspond to, for example,a QoS determiner as discussed herein. An ASIC for determining whether totransmit 1304 may correspond to, for example, a RUM controller asdiscussed herein. An ASIC for generating an indication 1306 maycorrespond to, for example, a channel analyzer as discussed herein. AnASIC for determining the number of interferers 1308 may correspond to,for example, an interference determiner as discussed herein.

As noted above, in some aspects these components may be implemented viaappropriate processor components. These processor components may in someaspects be implemented, at least in part, using structure as taughtherein. In some aspects a processor may be adapted to implement aportion or all of the functionality of one or more of these components.In some aspects one or more of the components represented by dashedboxes are optional.

As noted above, the apparatuses 1100, 1200, and 1300 may comprise one ormore integrated circuits. For example, in some aspects a singleintegrated circuit may implement the functionality of one or more of theillustrated components, while in other aspects more than one integratedcircuit may implement the functionality of one or more of theillustrated components.

In addition, the components and functions represented by FIGS. 11-13 aswell as other components and functions described herein, may beimplemented using any suitable means. Such means also may beimplemented, at least in part, using corresponding structure as taughtherein. For example, the components described above in conjunction withthe “ASIC for” components of FIGS. 11-13 also may correspond tosimilarly designated “means for” functionality. Thus, in some aspectsone or more of such means may be implemented using one or more ofprocessor components, integrated circuits, or other suitable structureas taught herein.

Also, it should be understood that any reference to an element hereinusing a designation such as “first,” “second,” and so forth does notgenerally limit the quantity or order of those elements. Rather, thesedesignations may be used herein as a convenient method of distinguishingbetween two or more elements or instances of an element. Thus, areference to first and second elements does not mean that only twoelements may be employed there or that the first element must precedethe second element in some manner. Also, unless stated otherwise a setof elements may comprise one or more elements. In addition, terminologyof the form “at least one of: A, B, or C” used in the description or theclaims means “A or B or C or any combination thereof”

Those of skill in the art would understand that information and signalsmay be represented using any of a variety of different technologies andtechniques. For example, data, instructions, commands, information,signals, bits, symbols, and chips that may be referenced throughout theabove description may be represented by voltages, currents,electromagnetic waves, magnetic fields or particles, optical fields orparticles, or any combination thereof.

Those of skill would further appreciate that any of the variousillustrative logical blocks, modules, processors, means, circuits, andalgorithm steps described in connection with the aspects disclosedherein may be implemented as electronic hardware (e.g., a digitalimplementation, an analog implementation, or a combination of the two,which may be designed using source coding or some other technique),various forms of program or design code incorporating instructions(which may be referred to herein, for convenience, as “software” or a“software module”), or combinations of both. To clearly illustrate thisinterchangeability of hardware and software, various illustrativecomponents, blocks, modules, circuits, and steps have been describedabove generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular application and design constraints imposed on the overallsystem. Skilled artisans may implement the described functionality invarying ways for each particular application, but such implementationdecisions should not be interpreted as causing a departure from thescope of the present disclosure.

The various illustrative logical blocks, modules, and circuits describedin connection with the aspects disclosed herein may be implementedwithin or performed by an integrated circuit (“IC”), an access terminal,or an access point. The IC may comprise a general purpose processor, adigital signal processor (DSP), an application specific integratedcircuit (ASIC), a field programmable gate array (FPGA) or otherprogrammable logic device, discrete gate or transistor logic, discretehardware components, electrical components, optical components,mechanical components, or any combination thereof designed to performthe functions described herein, and may execute codes or instructionsthat reside within the IC, outside of the IC, or both. A general purposeprocessor may be a microprocessor, but in the alternative, the processormay be any conventional processor, controller, microcontroller, or statemachine. A processor may also be implemented as a combination ofcomputing devices, e.g., a combination of a DSP and a microprocessor, aplurality of microprocessors, one or more microprocessors in conjunctionwith a DSP core, or any other such configuration.

It is understood that any specific order or hierarchy of steps in anydisclosed process is an example of a sample approach. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the processes may be rearranged while remaining within thescope of the present disclosure. The accompanying method claims presentelements of the various steps in a sample order, and are not meant to belimited to the specific order or hierarchy presented.

The steps of a method or algorithm described in connection with theaspects disclosed herein may be embodied directly in hardware, in asoftware module executed by a processor, or in a combination of the two.A software module (e.g., including executable instructions and relateddata) and other data may reside in a data memory such as RAM memory,flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a harddisk, a removable disk, a CD-ROM, or any other form of computer-readablestorage medium known in the art. A sample storage medium may be coupledto a machine such as, for example, a computer/processor (which may bereferred to herein, for convenience, as a “processor”) such theprocessor can read information (e.g., code) from and write informationto the storage medium. A sample storage medium may be integral to theprocessor. The processor and the storage medium may reside in an ASIC.The ASIC may reside in user equipment. In the alternative, the processorand the storage medium may reside as discrete components in userequipment. Moreover, in some aspects any suitable computer-programproduct may comprise a computer-readable medium comprising codes (e.g.,executable by at least one computer) relating to one or more of theaspects of the disclosure. In some aspects a computer program productmay comprise packaging materials.

The previous description of the disclosed aspects is provided to enableany person skilled in the art to make or use the present disclosure.Various modifications to these aspects will be readily apparent to thoseskilled in the art, and the generic principles defined herein may beapplied to other aspects without departing from the scope of thedisclosure. Thus, the present disclosure is not intended to be limitedto the aspects shown herein but is to be accorded the widest scopeconsistent with the principles and novel features disclosed herein.

What is claimed is:
 1. A method of wireless communication, comprising:receiving a resource utilization message that includes a channel gainindication; determining whether quality of service associated withreceived resource utilization message is acceptable; and determiningwhether to react to the resource utilization message based on thechannel gain indication, wherein a first node receives the resourceutilization message from a second node; and wherein the channel gainindication comprises an estimate of channel gain between the second nodeand a third node that sends data to the second node.
 2. The method ofclaim 1, further comprising estimating channel gain between the firstand second nodes, wherein the determination of whether to react to theresource utilization message is further based on the estimate of channelgain between the first and second nodes.
 3. The method of claim 2,wherein the determination of whether to react to the resourceutilization message comprises reacting according to a probability thatis based on the channel gain indication and the estimate of channel gainbetween the first and second nodes.
 4. The method of claim 2, whereinthe determination of whether to react to the resource utilizationmessage comprises reacting according to a probability that is based onrelative magnitudes of the channel gain indication and the estimate ofchannel gain between the first and second nodes.
 5. The method of claim1, wherein: the resource utilization message further comprises anindication relating to a number of nodes that interfere with receptionat the second node; and the determination of whether to react to theresource utilization message is further based on the indication relatingto the number of interfering nodes.
 6. The method of claim 5, wherein:the determination of whether to react to the resource utilizationmessage comprises reacting according to a probability that is based onthe channel gain indication; and the method further comprises adaptingthe probability in an inverse manner with respect to an increase or adecrease associated with the number of interfering nodes.
 7. The methodof claim 5, wherein: the channel gain indication comprises an estimateof channel gain between the second node and a third node that sends datato the second node; the method further comprises estimating channel gainbetween the first and second nodes; and the determination of whether toreact to the resource utilization message comprises reacting accordingto a probability that is based on the channel gain indication, theestimate of channel gain between the first and second nodes, and theindication relating to the number of interfering nodes.
 8. The method ofclaim 1, wherein the determination of whether to react to the resourceutilization message is further based on a plurality of received resourceutilization messages.
 9. The method of claim 8, wherein thedetermination of whether to react to the resource utilization messagecomprises reacting according to a probability that is based on theplurality of received resource utilization messages.
 10. The method ofclaim 9, wherein a subset of the plurality of received resourceutilization messages caused a node to limit transmission during at leastone transmission opportunity.
 11. The method of claim 10, furthercomprising adapting the probability in an inverse manner with respect toan increase or a decrease in how many recently received resourceutilization messages caused the node to limit transmission.
 12. Themethod of claim 10, wherein the subset comprises resource utilizationmessages that were received from a specific node.
 13. The method ofclaim 12, wherein each resource utilization message of the subsetincludes a node identifier.
 14. The method of claim 10, wherein theresource utilization messages of the subset are associated with a commonreceived power classification.
 15. The method of claim 10, wherein theresource utilization messages of the subset are associated with a commonpriority classification.
 16. The method of claim 8, wherein thedetermination of whether to react to the resource utilization messagefurther comprises reacting based on a resource utilization messagerejection threshold.
 17. The method of claim 1, wherein thedetermination of whether to react to the resource utilization messagecomprises determining whether to limit transmission during an upcomingtransmission opportunity.
 18. The method of claim 17, wherein the limitof transmission comprises abstaining from transmitting, reducingtransmit power, or transmitting on another resource.
 19. An apparatusfor wireless communication, comprising: a first node comprising: areceiver configured to receive a resource utilization message thatincludes a channel gain indication; a quality of service determinerconfigured to determine whether quality of service associated withreceived resource utilization message is acceptable; and a transmissioncontroller configured to determine whether to react to the resourceutilization message based on the channel gain indication, wherein thefirst node receives the resource utilization message from a second node;and wherein the channel gain indication comprises an estimate of channelgain between the second node and a third node that sends data to thesecond node.
 20. The apparatus of claim 19, further comprising a channelanalyzer configured to estimate channel gain between the first andsecond nodes, wherein the transmission controller is further configuredto determine whether to react to the resource utilization message basedon the estimate of channel gain between the first and second nodes. 21.The apparatus of claim 20, wherein the transmission controller isfurther configured to determine whether to react to the resourceutilization message according to a probability that is based on thechannel gain indication and the estimate of channel gain between thefirst and second nodes.
 22. The apparatus of claim 20, wherein thetransmission controller is further configured to determine whether toreact to the resource utilization message according to a probabilitythat is based on relative magnitudes of the channel gain indication andthe estimate of channel gain between the first and second nodes.
 23. Theapparatus of claim 19, wherein: the resource utilization message furthercomprises an indication relating to a number of nodes that interferewith reception at the second node; and the transmission controller isfurther configured to determine whether to react to the resourceutilization message based on the indication relating to the number ofinterfering nodes.
 24. The apparatus of claim 23, wherein: thetransmission controller is further configured to determine whether toreact to the resource utilization message according to a probabilitythat is based on the channel gain indication; and the apparatus furthercomprises a parameter adapter configured to adapt the probability in aninverse manner with respect to an increase or a decrease associated withthe number of interfering nodes.
 25. The apparatus of claim 23, wherein:the channel gain indication comprises an estimate of channel gainbetween the second node and a third node that sends data to the secondnode; the apparatus further comprises a channel analyzer configured toestimate channel gain between the first and second nodes; and thetransmission controller is further configured to determine whether toreact to the resource utilization message according to a probabilitythat is based on the channel gain indication, the estimate of channelgain between the first and second nodes, and the indication relating tothe number of interfering nodes.
 26. The apparatus of claim 19, whereinthe transmission controller is further configured to determine whetherto react to the resource utilization message based on a plurality ofreceived resource utilization messages.
 27. The apparatus of claim 26,wherein the transmission controller is further configured to determinewhether to react to the resource utilization message according to aprobability that is based on the plurality of received resourceutilization messages.
 28. The apparatus of claim 27, wherein a subset ofthe plurality of received resource utilization messages caused a node tolimit transmission during at least one transmission opportunity.
 29. Theapparatus of claim 28, further comprising a parameter adapter configuredto adapt the probability in an inverse manner with respect to anincrease or a decrease in how many recently received resourceutilization messages caused the node to limit transmission.
 30. Theapparatus of claim 28, wherein the subset comprises resource utilizationmessages that were received from a specific node.
 31. The apparatus ofclaim 30, wherein each resource utilization message of the subsetincludes a node identifier.
 32. The apparatus of claim 28, wherein theresource utilization messages of the subset are associated with a commonreceived power classification.
 33. The apparatus of claim 28, whereinthe resource utilization messages of the subset are associated with acommon priority classification.
 34. The apparatus of claim 26, whereinthe determination of whether to react to the resource utilizationmessage further comprises reacting based on a resource utilizationmessage rejection threshold.
 35. The apparatus of claim 19, thetransmission controller is further configured to determine whether tolimit transmission during an upcoming transmission opportunity.
 36. Theapparatus of claim 35, wherein the limit of transmission comprisesabstaining from transmitting, reducing transmit power, or transmittingon another resource.
 37. An apparatus for wireless communication,comprising: a first node comprising: means for receiving a resourceutilization message that includes a channel gain indication; means fordetermining whether quality of service associated with received resourceutilization message is acceptable; and means for determining whether toreact to the resource utilization message based on the channel gainindication, wherein the first node receives the resource utilizationmessage from a second node; and wherein the channel gain indicationcomprises an estimate of channel gain between the second node and athird node that sends data to the second node.
 38. The apparatus ofclaim 37, further comprising means for estimating channel gain betweenthe first and second nodes, wherein the means for determining furtherdetermines whether to react to the resource utilization message based onthe estimate of channel gain between the first and second nodes.
 39. Theapparatus of claim 38, wherein the means for determining furtherdetermines whether to react to the resource utilization messageaccording to a probability that is based on the channel gain indicationand the estimate of channel gain between the first and second nodes. 40.The apparatus of claim 38, wherein the means for determining furtherdetermines whether to react to the resource utilization messageaccording to a probability that is based on relative magnitudes of thechannel gain indication and the estimate of channel gain between thefirst and second nodes.
 41. The apparatus of claim 37, wherein: theresource utilization message further comprises an indication relating toa number of nodes that interfere with reception at the second node; andthe means for determining further determines whether to react to theresource utilization message based on the indication relating to thenumber of interfering nodes.
 42. The apparatus of claim 41, wherein: themeans for determining further determines whether to react to theresource utilization message according to a probability that is based onthe channel gain indication; and the apparatus further comprises meansfor adapting the probability in an inverse manner with respect to anincrease or a decrease associated with the number of interfering nodes.43. The apparatus of claim 41, wherein: the channel gain indicationcomprises an estimate of channel gain between the second node and athird node that sends data to the second node; the apparatus furthercomprises means for estimating channel gain between the first and secondnodes; and the means for determining further determines whether to reactto the resource utilization message according to a probability that isbased on the channel gain indication, the estimate of channel gainbetween the first and second nodes, and the indication of the number ofinterfering nodes.
 44. The apparatus of claim 37, wherein the means fordetermining further determines whether to react to the resourceutilization message based on a plurality of received resourceutilization messages.
 45. The apparatus of claim 44, wherein the meansfor determining further determines whether to react to the resourceutilization message according to a probability that is based on theplurality of received resource utilization messages.
 46. The apparatusof claim 45, wherein a subset of the plurality of received resourceutilization messages caused a node to limit transmission during at leastone transmission opportunity.
 47. The apparatus of claim 46, furthercomprising means for adapting the probability in an inverse manner withrespect to an increase or a decrease in how many recently receivedresource utilization messages caused the node to limit transmission. 48.The apparatus of claim 46, wherein the subset comprises resourceutilization messages that were received from a specific node.
 49. Theapparatus of claim 48, wherein each resource utilization message of thesubset includes a node identifier.
 50. The apparatus of claim 46,wherein the resource utilization messages of the subset are associatedwith a common received power classification.
 51. The apparatus of claim46, wherein the resource utilization messages of the subset areassociated with a common priority classification.
 52. The apparatus ofclaim 44, wherein the determination of whether to react to the resourceutilization message further comprises reacting based on a resourceutilization message rejection threshold.
 53. The apparatus of claim 37,wherein the means for determining further determines whether to limittransmission during an upcoming transmission opportunity.
 54. Theapparatus of claim 53, wherein the limit of transmission comprisesabstaining from transmitting, reducing transmit power, or transmittingon another resource.
 55. A non-transitory computer-readable mediumencoded with computer executable instructions comprising: instructionsfor receiving a resource utilization message that includes a channelgain indication; instructions for determining whether quality of serviceassociated with received resource utilization message is acceptable; andinstructions for determining whether to react to the resourceutilization message based on the channel gain indication, wherein afirst node receives the resource utilization message from a second node;and wherein the channel gain indication comprises an estimate of channelgain between the second node and a third node that sends data to thesecond node.
 56. An access point, comprising: an antenna; a receiverconfigured to receive, via the antenna, a resource utilization messagethat includes a channel gain indication; and a transmission controllerconfigured to determine whether to react to the resource utilizationmessage based on the channel gain indication, wherein the receiverreceives the resource utilization message from a second node; andwherein the channel gain indication comprises an estimate of channelgain between the second node and a third node that sends data to thesecond node.
 57. An access terminal, comprising: a receiver configuredto receive a resource utilization message that includes a channel gainindication; a transmission controller configured to determine whether toreact to the resource utilization message based on the channel gainindication; and a user interface configured to output an indicationbased on data received via the receiver, wherein the receiver receivesthe resource utilization message from a second node; and wherein thechannel gain indication comprises an estimate of channel gain betweenthe second node and a third node that sends data to the second node. 58.A method of wireless communication, comprising: at a first node:determining whether quality of service associated with data received ata node via a channel is acceptable; generating an indication of channelgain associated with the channel; and determining, based on a result ofthe quality of service determination, whether to transmit a resourceutilization message that includes the channel gain indication, whereinthe first node receives the resource utilization message from a secondnode; and wherein the channel gain indication comprises an estimate ofchannel gain between the second node and a third node that sends data tothe second node.
 59. The method of claim 58, further comprisingdetermining a number of interferers that interfere with reception at thenode, wherein the resource utilization message further comprises anindication relating to the number of interferers.
 60. The method ofclaim 58, wherein the indication relating to the number of interfererscomprises an index for a look-up table of functions.
 61. The method ofclaim 58, wherein the resource utilization message further comprises anode identifier.
 62. An apparatus for wireless communication,comprising: a first node comprising: a quality of service determinerconfigured to determine whether quality of service associated with datareceived at a node via a channel is acceptable; a channel analyzerconfigured to generate an indication of channel gain associated with thechannel; and a resource utilization message controller configured todetermine, based on a result of the quality of service determination,whether to transmit a resource utilization message that includes thechannel gain indication, wherein the first node receives the resourceutilization message from a second node; and wherein the channel gainindication comprises an estimate of channel gain between the second nodeand a third node that sends data to the second node.
 63. The apparatusof claim 62, wherein the channel gain indication comprises an estimateof channel gain between the node and another node that transmits data tothe node via the channel.
 64. The apparatus of claim 62, furthercomprising an interference determiner configured to determine a numberof interferers that interfere with reception at the node, wherein theresource utilization message further comprises an indication relating tothe number of interferers.
 65. The apparatus of claim 62, wherein theindication relating to the number of interferers comprises an index fora look-up table of functions.
 66. The apparatus of claim 62, wherein theresource utilization message further comprises a node identifier.
 67. Anapparatus for wireless communication, comprising: a first nodecomprising: means for determining whether quality of service associatedwith data received at a node via a channel is acceptable; means forgenerating an indication of channel gain associated with the channel;and means for determining, based on a result of the quality of servicedetermination, whether to transmit a resource utilization message thatincludes the channel gain indication, wherein the first node receivesthe resource utilization message from a second node; and wherein thechannel gain indication comprises an estimate of channel gain betweenthe second node and a third node that sends data to the second node. 68.The apparatus of claim 67, wherein the channel gain indication comprisesan estimate of channel gain between the node and another node thattransmits data to the node via the channel.
 69. The apparatus of claim67, further comprising means for determining a number of interferersthat interfere with reception at the node, wherein the resourceutilization message further comprises an indication relating to thenumber of interferers.
 70. The apparatus of claim 67, wherein theindication relating to the number of interferers comprises an index fora look-up table of functions.
 71. The apparatus of claim 67, wherein theresource utilization message further comprises a node identifier.
 72. Anon-transitory computer-readable medium encoded with computer executableinstructions comprising : instructions for determining whether qualityof service associated with data received at a node via a channel isacceptable; instructions for generating an indication of channel gainassociated with the channel; and instructions for determining, based ona result of the quality of service determination, whether to transmit aresource utilization message that includes the channel gain indication,wherein a first node receives the resource utilization message from asecond node; and wherein the channel gain indication comprises anestimate of channel gain between the second node and a third node thatsends data to the second node.
 73. An access point, comprising: a firstnode comprising: an antenna; a quality of service determiner configuredto determine whether quality of service associated with data received ata node via a channel is acceptable; a channel analyzer configured togenerate an indication of channel gain associated with the channel; anda resource utilization message controller configured to determine, basedon a result of the quality of service determination, whether to transmita resource utilization message that includes the channel gain indicationvia the antenna, wherein the first node receives the resourceutilization message from a second node; and wherein the channel gainindication comprises an estimate of channel gain between the second nodeand a third node that sends data to the second node.
 74. An accessterminal, comprising: a first node comprising: a quality of servicedeterminer configured to determine whether quality of service associatedwith data received at a node via a channel is acceptable; a channelanalyzer configured to generate an indication of channel gain associatedwith the channel; a resource utilization message controller configuredto determine, based on a result of the quality of service determination,whether to transmit a resource utilization message that includes thechannel gain indication; and a user interface configured to output anindication based on the received data, wherein the first node receivesthe resource utilization message from a second node; and wherein thechannel gain indication comprises an estimate of channel gain betweenthe second node and a third node that sends data to the second node. 75.A method of wireless communication, comprising: step of receiving aresource utilization message that includes a channel gain indication;and step of determining whether to react to the resource utilizationmessage based on the channel gain indication, wherein receiving aresource utilization message includes a first node receives the resourceutilization message from a second node; and the channel gain indicationcomprises an estimate of channel gain between the second node and athird node that sends data to the second node.
 76. The method of claim75, further comprising: step of estimating channel gain between thefirst and second nodes, wherein determining whether to react to theresource utilization message is further based on the estimate of channelgain between the first and second nodes.